Scope Dominance with Upward Monotone Quantifiers
نویسندگان
چکیده
We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1x Q2y ! Q2y Q1x . This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff either Q1 is 9 or Q2 is 8 (excluding trivial cases). Our result shows that in infinite domains, there are more general types of quantifiers that support these entailments.
منابع مشابه
Computing Scope Dominance with Upward Monotone Quantifiers
This paper describes an algorithm that characterizes logical relations between different interpretations of scopally ambiguous sentences. The proposed method uses general properties of natural language determiners in order to generate a model which is indicative of such entailment relations. The computation of this model involves information about cardinalities of noun denotations and containme...
متن کاملScope Dominance with Monotone Quantifiers over Finite Domains
We characterize pairs of monotone generalized quantifiers Q1 and Q2 over finite domains that give rise to an entailment relation between their two relative scope construals. This relation between quantifiers, which is referred to as scope dominance, is used for identifying entailment relations between the two scopal interpretations of simple sentences of the form NP1-VNP2. Simple numerical or s...
متن کاملOn Scope Dominance With Monotone Quantifiers
We characterize pairs of monotone generalized quantifiers Q1 and Q2 that give rise to an entailment relation between their two relative scope construals. This result is used for identifying entailment relations between the two scopal interpretations of simple sentences of the form NP1-V-NP2 . The general characterization that we give turns out to cover more examples of such entailments besides ...
متن کاملNew directions for proof theory in linguistics
We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1x Q2y ! Q2y Q1x . This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff Q1 is 9 or Q2 is 8 (excluding trivial cases). Our result shows that in infinite domains, there are more gener...
متن کاملLearning generalized quantifiers
This paper addresses the question of the learnability of generalized quantifiers. This topic was first taken up in (van Benthem 1986a) but has received little attention since then. There are a few results: in (Clark 1996) it was shown that first-order generalized quantifiers are learnable with membership queries. In (Tiede 1999) it was shown, among other things, that the left upward monotone qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Logic, Language and Information
دوره 14 شماره
صفحات -
تاریخ انتشار 2005